A Survey of Constraint Handling Techniques in Evolutionary Computation Methods
نویسنده
چکیده
One of the major components of any evolutionary system is the evaluation function. Evaluation functions are used to assign a quality measure for individuals in a population. Whereas evolutionary computation techniques assume the existence of an (e cient) evaluation function for feasible individuals, there is no uniform methodology for handling (i.e., evaluating) unfeasible ones. The simplest approach, incorporated by evolution strategies and a version of evolutionary programming (for numerical optimization problems), is to reject unfeasible solutions. But several other methods for handling unfeasible individuals have emerged recently. This paper reviews such methods (using a domain of nonlinear programming problems) and discusses their merits and drawbacks.
منابع مشابه
A Survey of Constraint HandlingTechniques in
One of the major components of any evolutionary system is the evaluation function. Evaluation functions are used to assign a quality measure for individuals in a population. Whereas evolutionary computation techniques assume the existence of an (eecient) evaluation function for feasible individuals, there is no uniform methodology for handling (i.e., evaluating) unfeasible ones. The simplest ap...
متن کاملEvolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization
During the last five years, several methods have been proposed for handling nonlinear constraints using evolutionary algorithms (EAs) for numerical optimization problems. Recent survey papers classify these methods into four categories: preservation of feasibility, penalty functions, searching for feasibility, and other hybrids. In this paper we investigate a new approach for solving constraine...
متن کاملSEQUENTIAL PENALTY HANDLING TECHNIQUES FOR SIZING DESIGN OF PIN-JOINTED STRUCTURES BY OBSERVER-TEACHER-LEARNER-BASED OPTIMIZATION
Despite comprehensive literature works on developing fitness-based optimization algorithms, their performance is yet challenged by constraint handling in various engineering tasks. The present study, concerns the widely-used external penalty technique for sizing design of pin-jointed structures. Observer-teacher-learner-based optimization is employed here since previously addressed by a number ...
متن کاملEvolutionary Algorithms and Constraint Satisfaction: Definitions, Survey, Methodology, and Research Directions
In this tutorial we consider the issue of constraint handling by evolutionary algorithms (EA). We start this study with a categorization of constrained problems and observe that constraint handling is not straightforward in an EA. Namely, the search operators mutation and recombination are ‘blind’ to constraints. Hence, there is no guarantee that if the parents satisfy some constraints the offs...
متن کاملConstraint-Handling Techniques C5.2 Penalty functions
This section begins with the motivation and general form of penalty functions as used in evolutionary computation. The main types of penalty function—constant, static, dynamic, and adaptive—are described within a common notation framework. References from the literature concerning these exterior penalty approaches are presented. The section concludes with a brief discussion of promising areas o...
متن کامل